KAT and PHL in Coq

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

KAT and PHL in Coq

In this article we describe an implementation of Kleene algebra with tests (KAT) in the Coq theorem prover. KAT is an equational system that has been successfully applied in program verification and, in particular, it subsumes the propositional Hoare logic (PHL). We also present an PHL encoding in KAT, by deriving its deduction rules as theorems of KAT. Some examples of simple program's formal ...

متن کامل

Coq in Coq

We formalize the deenition and the metatheory of the Calculus of Constructions (CC) using the proof assistant Coq. In particular, we prove strong nor-malization and decidability of type inference. From the latter proof, we extract a certiied Objective Caml program which performs type inference in CC and use this code to build a small-scale certiied proof-checker.

متن کامل

Automata for KAT Expressions

Kleene algebra with tests (KAT) is a decidable equational system for program verification, that uses both Kleene and Boolean algebras. In spite of KAT ’s elegance and success in providing theoretical solutions for several problems, not many efforts have been made towards obtaining tractable decision procedures that could be used in practical software verification tools. The main drawback of the...

متن کامل

Sets in Coq, Coq in Sets

We present a Coq reflexive tactic for deciding equalities or inequalities in Kleene algebras. This tactic is part of a larger project, whose aim is to provide tools for reasoning about binary relations in Coq: binary relations form a Kleene algebra, where the star operation is the reflexive transitive closure. Our tactic relies on an initiality theorem, whose proof goes by replaying finite auto...

متن کامل

Coq in

We formalize the deenition and the metatheory of the Calculus of Constructions (CC) using the proof assistant Coq. In particular, we prove strong nor-malization and decidability of type inference. From the latter proof, we extract a certiied Objective Caml program which performs type inference in CC and use this code to build a small-scale certiied proof-checker.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Science and Information Systems

سال: 2008

ISSN: 1820-0214,2406-1018

DOI: 10.2298/csis0802137p